package Other;

public class leet_4 {
}

class Solution_4 {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        // 先确认中间的index数量
        int totalNum = nums1.length + nums2.length;


        int numIndex1 = 0;
        int numIndex2 = 0;

        while(totalNum!=0){

        }
        return 0.0;

    }
}